Some Overpartition k-tuple Congruence Properties

نویسنده

  • Robert G. Vary
چکیده

Each of the elements of this list is itself a partition, and the numbers in each partition are referred to as parts . As one may clearly deduce, the larger the number, the more partitions it has. Also of note is the fact that is the same as , that is, order is not accounted for. Typically, the parts of a partition are written in nonincreasing order. It is also commonly accepted that the function , where is a positive integer, is the function which counts the number of partitions of .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank and Congruences for Overpartition Pairs

The rank of an overpartition pair is a generalization of Dyson’s rank of a partition. The purpose of this paper is to investigate the role that this statistic plays in the congruence properties of pp(n), the number of overpartition pairs of n. Some generating functions and identities involving this rank are also presented.

متن کامل

Congruences for Overpartition K-tuples

An overpartition of the nonnegative integer n is a non-increasing sequence of natural numbers whose sum is n in which the first occurrence of a number may be overlined. Let k ≥ 1 be an integer. An overpartition k-tuple of a positive integer n is a k-tuple of overpartitions wherein all listed parts sum to n. Let pk(n) be the number of overpartition k-tuples of n. In this paper, we will give a sh...

متن کامل

Arithmetic Properties of Overpartition Pairs

Abstract. Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of pp(n), the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that there exist many Ramanujan-type congruences for pp(n). In this paper, we derive two Ramanujantype identities and some explicit congruences for pp(n). Moreo...

متن کامل

$k$-tuple total restrained domination/domatic in graphs

‎For any integer $kgeq 1$‎, ‎a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-‎tuple total dominating set of $G$ if any vertex‎ ‎of $G$ is adjacent to at least $k$ vertices in $S$‎, ‎and any vertex‎ ‎of $V-S$ is adjacent to at least $k$ vertices in $V-S$‎. ‎The minimum number of vertices of such a set‎ ‎in $G$ we call the $k$-tuple total restrained domination number of $G$‎. ‎The maximum num...

متن کامل

Another Proof of a Conjecture by Hirschhorn and Sellers on Overpartitions

We provide a new elementary proof for a Ramanujan-type congruence for the overpartition function modulo 40, which was previously conjectured by Hirschhorn and Sellers and later proved by Chen and Xia. We also find some new congruences for the overpartition function modulo 5 and 9.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009